Mining Frequent Sequential Patterns
نویسندگان
چکیده
منابع مشابه
Mining Frequent Max and Closed Sequential Patterns
Although frequent sequential pattern mining has an important role in many data mining tasks, however, it often generates a large number of sequential patterns, which reduces its efficiency and effectiveness. For many applications mining all the frequent sequential patterns is not necessary, and mining frequent Max, or Closed sequential patterns will provide the same amount of information. Compa...
متن کاملMining Frequent Sequential Patterns under a Similarity Constraint
Many practical applications are related to frequent sequential pattern mining, ranging from Web Usage Mining to Bioinformatics. To ensure an appropriate extraction cost for useful mining tasks, a key issue is to push the user-defined constraints deep inside the mining algorithms. In this paper, we study the search for frequent sequential patterns that are also similar to an user-defined referen...
متن کاملMining Frequent Ordered Patterns
Mining frequent patterns has been studied popularly in data mining research. All of previous studies assume that items in a pattern are unordered. However, the order existing between items must be considered in some applications. In this paper, we first give the formal model of ordered patterns and discuss the problem of mining frequent ordered patterns. Base on our analyses, we present two eff...
متن کاملMining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transaction database. With given minimum support (min_sup) and minimum share support (min_share_sup), each SFP includes a core frequent pattern (BFP) used to draw other frequent or sub-frequent items. A latter query returns a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Big Data Research
سال: 2021
ISSN: 2768-0207
DOI: 10.14302/issn.2768-0207.jbr-21-3455